Review: Kd-tree Traversal Algorithms for Ray Tracing
نویسندگان
چکیده
In this paper we review the traversal algorithms for kd-trees for ray tracing. Ordinary traversal algorithms such as sequential, recursive, and those with neighbor-links have different limitations, which led to several new developments within the last decade. We describe algorithms exploiting ray coherence and algorithms designed with specific hardware architecture limitations such as memory latency and consumption in mind. We also discuss the robustness of traversal algorithms as one issue that has been neglected in previous research.
منابع مشابه
Review and Comparative Study of Ray Traversal Algorithms on a Modern GPU Architecture
In this paper we present a chronological review of five distinct data structures commonly found in literature and ray tracing systems: Bounding Volume Hierarchies (BVH), Octrees, Uniform Grids, KD-Trees, and Bounding Interval Hierarchies (BIH). This review is then followed by an extensive comparative study of six different ray traversal algorithms implemented on a modern Kepler CUDA GPU archite...
متن کاملStack Implementation on Programmable Graphics Hardware
We present a technique that allows the implementation of a stack on programmable graphics hardware, using textures and fragment shaders. This development enables a whole new class of GPU algorithms, including recursive functions on complex data structures. Kd-tree traversal for ray tracing is demonstrated as an application. The traversal core was integrated into a purely GPU based photorealisti...
متن کاملHybrid CPU/GPU KD-Tree Construction for Versatile Ray Tracing
We propose an hybrid CPU-GPU ray-tracing implementation based on an optimal Kd-Tree as acceleration structure. The construction and traversal of this KD-tree takes benefit from both the CPU and the GPU to achieve high-performance ray-tracing on mainstream hardware. Our approach, flexible enough to use only a single computing unit (CPU or GPU), is able to efficiently distribute workload between ...
متن کاملStackless KD-Tree Traversal for High Performance GPU Ray Tracing
Significant advances have been achieved for realtime ray tracing recently, but realtime performance for complex scenes still requires large computational resources not yet available from the CPUs in standard PCs. Incidentally, most of these PCs also contain modern GPUs that do offer much larger raw compute power. However, limitations in the programming and memory model have so far kept the perf...
متن کاملImproving Memory Space Efficiency of Kd-tree for Real-time Ray Tracing
Compared with its competitors such as the bounding volume hierarchy, a drawback of the kd-tree structure is that a large number of triangles are repeatedly duplicated during its construction, which often leads to inefficient, large and tall binary trees with high triangle redundancy. In this paper, we propose a space-efficient kd-tree representation where, unlike commonly used methods, an inner...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 30 شماره
صفحات -
تاریخ انتشار 2011